Solving Graph Coloring Problems Using Cultural Algorithm

This paper proposes a new method based on the cultural algorithm to solve graph coloring problem (GCP). Graph coloring problem involves finding the minimum number of colors for coloring the graph vertices such that adjacent vertices have distinct colors. In this paper various components of cultural algorithm have been implemented to solve GCP with a self adaptive behavior in an efficient manner. As a result of utilizing the cultural algorithm, the proposed algorithm results on finding the solution significantly fast. The experimental results show that the proposed algorithm has a high performance in solving this problem. Keywords-cultural algorithm; evolutionary algorithms; graph coloring; self adaptive;